Open constraint algebras

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

{41 () Constraint Query Algebras

Constraint query languages are natural extensions of relational database query languages. A framework for their declarative speciication (constraint calculi) and eecient implementation (low data complexity and secondary storage indexing) was presented in Kanellakis et al., 1995. Constraint query algebras form a procedural language layer between high-level declarative calculi and low-level index...

متن کامل

Open-closed field algebras

We introduce the notions of open-closed field algebra and open-closed field algebra over a vertex operator algebra V . In the case that V satisfies certain finiteness and reductivity conditions, we show that an open-closed field algebra over V canonically gives an algebra over a C-extension of Swiss-cheese partial operad. We also give a tensor-categorical formulation and constructions of open-c...

متن کامل

Open constraint programming

Traditionally, constraint satisfaction problems (CSP) have assumed closed-world scenarios where all domains and constraints are fixed from the beginning. With the Internet, many of the traditional CSP applications in resource allocation, scheduling and planning pose themselves in open-world settings, where domains and constraints must be discovered from different sources in a network. To model ...

متن کامل

Open Constraint Optimization

Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet, many of the traditional CSP applications in resource allocation, scheduling and planning pose themselves in open-world settings, where options and constraints must be gathered from different agents in a network. We de...

متن کامل

Open Constraint Programming

A new model for high-level concurrent programming is presented. Designed for implementing programs which manipulate and react to shared data which is highly structured, its main elements are: a shared constraint store, deened as a theory-update system a notion of reactor, which is a program fragment written in a generic reactive programming language; a general use of agents, deened as arbitrary...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics: Conference Series

سال: 2006

ISSN: 1742-6588,1742-6596

DOI: 10.1088/1742-6596/33/1/054